“Integer-making” theorems
نویسندگان
چکیده
منابع مشابه
Edge Isoperimetric Theorems for Integer Point Arrays
We consider subsets of the n-dimensional grid with the Manhattan metrics, (i.e. the Cartesian product of chains of lengths k1, . . . , kn) and study those of them which have maximal number of induced edges of the grid, and those which are separable from their complement by the least number of edges. The first problem was considered for k1 = · · · = kn by Bollobás and Leader [2]. Here we extend ...
متن کاملSensitivity theorems in integer linear programming
We consider integer linear programming problems with a fixed coefficient matrix and varying objective function and right-hand-side vector. Among our results, we show that, for any optimal solution to a linear program max{wx: Ax <~ b}, the distance to the nearest optimal solution to the corresponding integer program is at most the dimension of the problem multiplied by the largest subdeterminant...
متن کاملTwo sensitivity theorems in fuzzy integer programming
We consider the problem of estimating optima of covering integer linear programs with 0-1 variables under the following conditions: we do not know exact values of elements in the constraint matrix A but we know what elements of A are zero and what are nonzero, and also know minimal and maximal values of nonzero elements. We find bounds for variation of the optima of such programs in the worst a...
متن کاملFiniteness Theorems in Stochastic Integer Programming
We study Graver test sets for families of linear multi-stage stochastic integer programs with varying number of scenarios. We show that these test sets can be decomposed into finitely many “building blocks”, independent of the number of scenarios, and we give an effective procedure to compute them. The paper includes an introduction to Nash-Williams’ theory of better-quasi-orderings, which is u...
متن کاملCombinatorial Integer Labeling Theorems on Finite Sets with Applications1
Tucker’s well-known combinatorial lemma states that, for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {±1,±2, · · · ,±n} with the property that antipodal vertices on the boundary of the cube are assigned opposite labels, the triangulation admits a 1-dimensional simplex whose tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1981
ISSN: 0166-218X
DOI: 10.1016/0166-218x(81)90022-6